SHORT ROUTE WITH OBSTACLES

Rectilinear short path queries among rectangular obstacles

Equitable partitioning with obstacles

We consider the problem of dividing a territory into sub-regions so as to balance the workloads of a collection of facilities or vehicles over that territory. We assume that the territory is a connected polygonal region, i.e. a simply connected polygon containing a set of simply connected obstacles. The territory also contains a collection of facilities, represented by a set of n fixed points i...

Overcoming Obstacles with Ants

Consider a group of mobile finite automata, referred to as agents, located in the origin of an infinite grid. The grid is occupied by obstacles, i.e., sets of cells that can not be entered by the agents. In every step, an agent can sense the states of the co-located agents and is allowed to move to any neighboring cell of the grid not blocked by an obstacle. We assume that the circumference of ...

Digital homotopy with obstacles

As a sequel of [4], this paper is devoted to the computation of the digital fundamental group πd 1(O/S;σ) defined by loops in the digital object O for which the digital object S acts as an “obstacle”. We prove that for arbitrary digital spaces the group πd 1(O/S;σ) maps onto the usual fundamental group of the difference of continuous analogues |AO∪S | − |AS |. Moreover, we show that this epimor...

Reading in People with Down syndrome: “visual route” or “phonological route”?

Abstract Background and Purpose: Many people with Down syndrome learn to read to some degree, but how they learn to read has been debated by researchers. Some researchers have argued that given the phonological deficits of people with Down syndrome and their stronger visual-spatial abilities, they rely on the “visual route” to learn to read, while others have shown that the “phonological ro...